Toddlers prefer those who win but not when they win by force
نویسندگان
چکیده
منابع مشابه
Win-win Theory for Win-win Success
THE INTELLECTUAL INVENTION THAT SURPASSES ALL OTHERS AS THE MOST BENEFICIAL ADVANCE OF HUMAN HISTORY IS RARELY UNDERSTOOD OR APPRECIATED BY EDUCATED ADULTS. With dire consequences for such neglect, there has been no applause for this wondrous invention, no gratitude for its beneficence, no monuments to hail its priceless influence. Largely overlooked, ignored, or taken for granted, this unceleb...
متن کاملWho pays to win again ?
In contest experiments, overbidding is a widely observed phenomenon. One common explanation for overbidding is that winning in itself yields utility, termed the joy of winning. However, the joy of winning is diffi cult to observe and to quantify. This paper develops a novel, incentivized way to measure the individual-specific joy of winning as well as the frustration of losing in a Tullock lott...
متن کاملWhen do simple policies win?
We present a simple model of a debate between two interested parties which takes into account the complexity of their policy positions. The two debaters engage in all-pay-auctions to win slots of time/attention to present their positions to a decision maker. Complexity of a policy is modelled through the number of slots of attention needed to get the policy across. We show that when the number ...
متن کاملThe Spirit of Competition: To Win or Not To Win
A competition is a contest between individuals or groups. The gain is often an award or recognition, which serves as a catalyst to motivate individuals to put forth their very best. Such events for recognition and success are part of many International Society for Computational Biology (ISCB) Student Council Regional Student Groups (RSGs) activities. These include a popular science article cont...
متن کاملWin-Win Kernelization
We study provably effective and efficient data reduction for a class of NP-hard graph modification problems based on vertex degree properties. We show fixed-parameter tractability for NP-hard graph completion (that is, edge addition) cases while we show that there is no hope to achieve analogous results for the corresponding vertex or edge deletion versions. Our algorithms are based on transfor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Human Behaviour
سال: 2018
ISSN: 2397-3374
DOI: 10.1038/s41562-018-0415-3